Computation of heterogeneous object co-embeddings from relational measurements

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Co-ordinating Heterogeneous Parallel Computation

There is a growing interest in heterogeneous high performance computing environments. These systems are diicult to program owing to the complexity of choosing the appropriate resource allocations and the diiculties in expressing these choices in traditional parallel languages. In this paper we propose a methodology for structured parallel programming using functional skeletons to express these ...

متن کامل

Querying Heterogeneous Object Views of a Relational Database

We present the query processing algorithm for the Penguin system. Penguin supports multiple object views on a relational database, so that data may be shared by applications with heterogeneous object schemata. Penguin also o ers an interface for the C++ language. We have developed a query processing algorithm for querying composite object views. The query algorithm takes a query on a composite ...

متن کامل

Computation of Co-PI Index of TUC4C8(R) Nanotubes

In this paper, at first we introduce a new index with the name Co-PI index and obtain some properties related this new index. Then we compute this new index for TUC4C8(R) nanotubes.

متن کامل

From Relational to Object-Oriented Integrity Simplification

1 Relational integrity checking technology can be transfered to deductive object bases by utilizing a simple logical framework for objects. The principles of object identity, aggregation and classi cation allow a more e cient constraint control by ner granularity of updates, composite updates and semantic constraint simpli cation. In many cases, meta-level constraints and deductive rules can be...

متن کامل

Analogical Inference for Multi-relational Embeddings

Large-scale multi-relational embedding refers to the task of learning the latent representations for entities and relations in large knowledge graphs. An effective and scalable solution for this problem is crucial for the true success of knowledgebased inference in a broad range of applications. This paper proposes a novel framework for optimizing the latent representations with respect to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2017

ISSN: 0031-3203

DOI: 10.1016/j.patcog.2016.12.004